Chinese remainder theorem - PDFSEARCH.IO - Document Search Engine

Chinese remainder theorem
Results: 54

#	Item
31	Applications to Chinese Remainder Theorem Applications to Chinese Remainder Theorem Abstract We demonstrate the usefulness of a simple mathematical result- the Chinese Remainder Theorem (CRT). A short informal introduct Add to Reading List Source URL: www.impic.org Language: English - Date: 2006-05-30 13:43:20 Modular arithmetic Public-key cryptography Electronic commerce RSA Multiplicative functions Euclidean algorithm Chinese remainder theorem Greatest common divisor Coprime Mathematics Number theory Abstract algebra
32	Pseudo-Random Generator Based on Chinese Remainder Theorem Jean Claude Bajard and Heinrich H¨ordegen LIRMM Univ. Montpellier 2 UMR CNRS, France ABSTRACT Pseudo-Random Generators (PRG) are fundamental in cryptography. Th Add to Reading List Source URL: 78.47.219.106 Language: English - Date: 2014-05-19 07:36:07 Theoretical computer science Pseudorandom number generators Algorithmic information theory Pseudorandomness Random number generation Randomness tests Diehard tests TestU01 Linear feedback shift register Randomness Cryptography Applied mathematics
33	THE NUMBER OF PRIME DIVISORS OF A PRODUCT OF CONSECUTIVE INTEGERS R. BALASUBRAMANIAN, SHANTA LAISHRAM, T. N. SHOREY, AND R. THANGADURAI Abstract. It is shown under Schinzel’s Hypothesis that for a given ` ≥ 1, there Add to Reading List Source URL: www.math.tifr.res.in Language: English - Date: 2008-12-29 04:12:04 Number theory Coprime Chinese remainder theorem Prime number Arithmetic function Euclidean algorithm Mathematics Modular arithmetic Abstract algebra
34	Complexity of the (Eﬀective) Chinese Remainder Theorem This is an alternate derivation of the time complexity of the eﬀective Chinese remainder theorem (CRT). The CRT allowed us to take a system of k congruences o Add to Reading List Source URL: www.untruth.org Language: English - Date: 2014-03-18 20:21:07 Factorial International Securities Identification Number Summation Prime number Mathematics Integer sequences .ni
35	JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 20, Number 2, April 2007, Pages 495–517 S[removed][removed]Article electronically published on September 19, 2006 Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2007-01-18 09:38:51 Modular arithmetic Algebraic number theory Commutative algebra Covering system Chinese remainder theorem Quadratic residue Euclidean algorithm Mathematics Abstract algebra Number theory
36	AN INTRODUCTION TO MATHEMATICAL CRYPTOGRAPHY ERRATA FOR THE FIRST EDITION JEFFREY HOFFSTEIN, JILL PIPHER, JOSEPH H. SILVERMAN Acknowledgements We would like to thank the following people who have sent us comments and cor Add to Reading List Source URL: www.math.brown.edu Language: English - Date: 2012-06-27 18:45:23 Probability theory Modular arithmetic Finite fields Probability space XTR Chinese remainder theorem Independence Euclidean algorithm Abstract algebra Mathematics Number theory
37	Cryptography and Computer Security CS255 Basic number theory fact sheet Part II: Arithmetic modulo composites Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2013-01-02 16:36:43 Modular arithmetic Public-key cryptography Finite fields Integer factorization algorithms RSA Euclidean algorithm Prime number Discrete logarithm Chinese remainder theorem Abstract algebra Mathematics Cryptography
38	Cryptography and Computer Security CS255 Basic number theory fact sheet Part II: Arithmetic modulo composites Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2011-12-30 21:35:18 Modular arithmetic Public-key cryptography Finite fields Integer factorization algorithms RSA Euclidean algorithm Prime number Discrete logarithm Chinese remainder theorem Abstract algebra Mathematics Cryptography
39	Cryptography and Computer Security CS255 Basic number theory fact sheet Part II: Arithmetic modulo composites Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2014-01-03 18:08:21 Modular arithmetic Public-key cryptography Finite fields Integer factorization algorithms RSA Euclidean algorithm Prime number Discrete logarithm Chinese remainder theorem Abstract algebra Mathematics Cryptography
40	Cryptography and Computer Security CS255 Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2010-02-16 02:29:22 Modular arithmetic Public-key cryptography Finite fields Integer factorization algorithms RSA Euclidean algorithm Prime number Discrete logarithm Chinese remainder theorem Abstract algebra Mathematics Cryptography

UPDATE